A construction of finite Frobenius rings and its application to partial difference sets
نویسندگان
چکیده
منابع مشابه
construction and validation of translation metacognitive strategy questionnaire and its application to translation quality
like any other learning activity, translation is a problem solving activity which involves executing parallel cognitive processes. the ability to think about these higher processes, plan, organize, monitor and evaluate the most influential executive cognitive processes is what flavell (1975) called “metacognition” which encompasses raising awareness of mental processes as well as using effectiv...
Circulant Partial Hadamard Matrices: Construction via General Difference Sets and Its Application to fMRI Experiments
An m × n matrix A = (ai,j) is circulant if ai+1,j+1 = ai,j where the subscripts are reduced modulo n. A question arising in stream cypher cryptanalysis is reframed as follows: For given n, what is the maximum value of m for which there exists a circulant m × n (±1)-matrix A such that AA = nIm. In 2013, Craigen et al. called such matrices circulant partial Hadamard matrices (CPHMs). They proved ...
متن کاملConstructions of Partial Difference Sets and Relative Difference Sets Using Galois Rings
We use Galois rings to construct partial diierence sets and relative diierence sets in non-elementary abelian p-groups. As an example, we also use Galois ring GR(4; 2) to construct a (96,20,4) diierence set in Z 4 Z 4 Z 6 .
متن کاملMultiplication in Cyclotomic Rings and its Application to Finite Fields
A representation of finite fields that has proved useful when implementing finite field arithmetic in hardware is based on an isomorphism between subrings and fields. In this paper, we present an unified formulation for multiplication in cyclotomic rings and cyclotomic fields in that most arithmetic operations are done on vectors. From this formulation we can generate optimized algorithms for m...
متن کاملCode Equivalence Characterizes Finite Frobenius Rings
In this paper we show that finite rings for which the code equivalence theorem of MacWilliams is valid for Hamming weight must necessarily be Frobenius. This result makes use of a strategy of Dinh and López-Permouth.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2007
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2006.07.034